Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming
نویسندگان
چکیده
We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm9block9Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard’s instances, including the 10 instances from set 12. & 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملMathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملA new method for solving fully fuzzy linear Bilevel programming problems
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...
متن کاملA NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS
There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eng. Appl. of AI
دوره 25 شماره
صفحات -
تاریخ انتشار 2012